Software synthesis from dataflow schedule graphs

نویسندگان

چکیده

Abstract The dataflow-model of computation is widely used in design and implementation signal processing systems. In dataflow-based processes, scheduling—the assignment coordination computational modules across resources—is a critical task that affects practical measures performance, including latency, throughput, energy consumption, memory requirements. Dataflow schedule graphs (DSGs) provide formal abstraction for representing schedules processes. DSG allows designers to model as separate dataflow graph, thereby providing formal, abstract (platform- language-independent) representation the schedule. this paper, we introduce methodology based on explicit specifications application cooperating models. We also develop new techniques tools automatically synthesizing efficient implementations multicore platforms from these coupled demonstrate proposed synthesis through case study involving real-time detection people vehicles using acoustic seismic sensors.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Adaptive software synthesis from extended dataflow specifications

Embedded software development approaches used models of computation such as dataflow, discrete events, synchronous/reactive, among others. Due to the specialization of the existing models, each one can be better applied to a specific application domain. Nevertheless, when there is no solution for applications in a specific domain, heterogeneous models have been used. In this context, this paper...

متن کامل

Memory Efficient Software Synthesis from Dataflow Graph

Due to the limited amount of memory resources in embedded systems, minimizing the memory requirements is an important goal of software synthesis. This paper presents a set of techniques to reduce the code and data size for software synthesis from graphical DSP programs based on the synchronous dataflow (SDF) model. By sharing the kernel code among multiple instances of a block, we can further r...

متن کامل

Memory-Optimized Software Synthesis from Dataflow Program Graphs with Large Size Data Samples

In multimedia and graphics applications, data samples of nonprimitive type require significant amount of buffer memory. This paper addresses the problem of minimizing the buffer memory requirement for such applications in embedded software synthesis from graphical dataflow programs based on the synchronous dataflow (SDF) model with the given execution order of nodes. We propose a memory minimiz...

متن کامل

Memory efficient software synthesis with mixed coding style from dataflow graphs

This paper presents a set of techniques to reduce the code and data sizes for software synthesis from graphical digital signal-processing programs based on the synchronous dataflow model. By sharing the kernel code among multiple instances of a block with a shared function, we can further reduce the code size below the previous results based on inline coding style. A systematic approach also is...

متن کامل

Synthesis of Embedded Software from Synchronous Dataflow Specifications

The implementation of software for embedded digital signal processing (DSP) applications is an extremely complex process. The complexity arises from escalating functionality in the applications; intense timeto-market pressures; and stringent cost, power and speed constraints. To help cope with such complexity, DSP system designers have increasingly been employing high-level, graphical design en...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: SN applied sciences

سال: 2021

ISSN: ['2523-3971', '2523-3963']

DOI: https://doi.org/10.1007/s42452-020-04135-6